Theoretical Computer Science 1993: Vol 111 Table of Contents

THEORETICAL COMPUTER SCIENCE
Algorithms, automata, complexity and games

Special Volume of Selected Papers of the Sixth Workshop on the Mathematical
Foundations of Programming Semantics, Kingston, Canada, May 1990

Guest Editors: M. Mislove and R.D. Tennent

VOLUME 111, NUMBERS 1-2, 12 APRIL 1993

Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts,
Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com-
pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fir Mathematik

M. Mislove and R.D. Tennent
Foreword

S. Abramsky

Computational interpretations of linear logic

R. Heckmann

Power domains and second-order predicates

M. Droste

On stable domains

F. Lamarche

Stable domains are generalized topological spaces

M.G. Main

Complete proof rules for strong fairness and strong extreme fairness
H. Dybkjzer and A. Melton

Comparing Hagino’s categorical programming language and typed lambda-calculi
L.S. Moss and S.R. Thatte

Modal logic and algebraic specifications

PC. Gilmore and G.K. Tsiknis

A logic for category theory

PC. Gilmore and G.K. Tsiknis
Logical foundations for programming semantics

Author Index Volume 111

CONTENTS
|
3
59
89
103
125
145
191
211
291